Pairwise Disjoint Paths Routing in Tori
نویسندگان
چکیده
منابع مشابه
Constructing Pairwise Disjoint Paths with
Let P be a simple polygon and let f(ui; u 0 i)g be m pairs of distinct vertices of P where for every distinct i; j m, there exist pairwise disjoint paths connecting ui to u 0 i and uj to u 0 j. We wish to construct m pairwise disjoint paths in the interior of P connecting ui to u 0 i for i = 1; : : : ; m, with minimal total number of line segments. We give an approximation algorithm which in O(...
متن کاملPairwise edge disjoint shortest paths in the n-cube
Complexity issues intrinsic to certain fundamental data dissemination problems in high-performance network topologies are discussed. In particular, we study the p-pairwise edge disjoint shortest paths problem.An efficient algorithm for the case when every source point is at a distance at most two from its target is presented and for pairs at a distance at most three we show that the problem is ...
متن کاملLink-disjoint paths for reliable QoS routing
The problem of finding link/node-disjoint paths between a pair of nodes in a network has received much attention in the past. This problem is fairly well understood when the links in a network are only specified by a single link weight. However, in the context of quality of service routing, links are specified by multiple link weights and restricted by multiple constraints. Unfortunately, the p...
متن کاملRouting Reliability Analysis of Partially Disjoint Paths
Alternative paths may significantly improve routing reliability in an IP network. One application of this technique is to enhance the reliability of the popular Open Shortest Path First (OSPF) routing protocol. In our proposed Reliable OSPF (ROSPF) routing protocol, one primary path and two alternate backup paths are deployed for data transmission. As expected, the number of shared links and ro...
متن کاملTime Optimal Node-to-Set Disjoint Paths Routing in Hypercubes
Due to their simplicity, hypercubes are a popular topology for the interconnection network of massively parallel systems. One critical issue when dealing with such parallel systems is routing: data transmission is at the center of any operation or computation. Additionally, as the number of processors inside modern supercomputers is huge, and continuously growing, fault tolerance ought to be ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3032684